Machine-Readable Dictionary Headwords
نویسندگان
چکیده
(5) The idea behind dictionaries for machine processing and that behind dictionaries that people can thumb through are di erent, so we have to be aware that di erent terms are used. It is often best to include in machine dictionaries even terms that are easy for people to understand and to break down into their key elements. For example, :n6HCf (on duty, at work) and F17nKv (the end of the same month).
منابع مشابه
Is Knowledge-Free Induction of Multiword Unit Dictionary Headwords a Solved Problem?
We seek a knowledge-free method for inducing multiword units from text corpora for use as machine-readable dictionary headwords. We provide two major evaluations of nine existing collocation-finders and illustrate the continuing need for improvement. We use Latent Semantic Analysis to make modest gains in performance, but we show the significant challenges encountered in trying this approach.
متن کاملLexical Disambiguation using Simulated Annealing
The resolution of lexical ambiguity is important for most natural language processing tasks, and a range of computational techniques have been proposed for its solution. None of these has yet proven effective on a large scale. In this paper, we describe a method for lexical disambiguation of text using the definitions in a machine-readable dictionary together with the technique of simulated ann...
متن کاملA new Dictionary of Swedish Pronunciation
This paper describes some aspects of a pronunciation dictionary for Swedish, "Svenskt Utlalslexikon" (SUL), which is piesenUy developed at our departm ent This dictionary provides, among other items, three kinds of information about Swedish pronunciation that are not included in standard dictionaries: information on varian ts , on inflected form s and com pounds, and on p ro p er names. SUL is ...
متن کاملAutomatically Identifying Morphological Relations in = Machine-Readable Dictionaries
We describe an automated method for identifying classes of morphologically related words in an on-line dictionary, and for linking individual senses in the derived form to one or more senses in the base form by means of morphological relation attributes. We also present an algorithm for computing a score reflecting the system’s certainty in these derivational links; this computation relies on t...
متن کاملSense-Linking in a Machine Readable Dictionary
Dictionaries contain a rich set of relationships between their senses, but often these relationships are only implicit. We report on our experiments to automatically identify links between the senses in a machine-readable dictionary. In particular, we automatically identify instances of zero-aax morphology, and use that information to nd speciic linkages between senses. This work has provided i...
متن کامل